On Packing Densities of Permutations
نویسندگان
چکیده
The density of a permutation pattern π in a permutation σ is the proportion of subsequences of σ of length |π| that are isomorphic to π. The maximal value of the density is found for several patterns π, and asymptotic upper and lower bounds for the maximal density are found in several other cases. The results are generalised to sets of patterns and the maximum density is found for all sets of length 3 patterns.
منابع مشابه
On packing densities of set partitions
We study packing densities for set partitions, which is a generalization of packing words. We use results from the literature about packing densities for permutations and words to provide packing densities for set partitions. These results give us most of the packing densities for partitions of the set {1, 2, 3}. In the final section we determine the packing density of the set partition {{1, 3}...
متن کاملNote on Packing Patterns in Colored Permutations
Packing patterns in permutations concerns finding the permutation with the maximum number of a prescribed pattern. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation containing the maximum number of a layered pattern among all permutations of length n. Consequently the packing density for all but two (up to equivalence) patterns up to...
متن کاملPacking densities of layered permutations and the minimum number of monotone sequences in layered permutations
In this paper, we present two new results of layered permutation densities. The first one generalizes theorems from Hästö (2003) and Warren (2004) to compute the permutation packing of permutations whose layer sequence is (1, l1, l2, . . . , lk) with 2−a−1 ≥ k (and similar permutations). As a second result, we prove that the minimum density of monotone sequences of length k + 1 in an arbitraril...
متن کاملLog-Normal and Mono-Sized Particles’ Packing into a Bounded Region
Many systems can be modeled with hard and various size spheres, therefore packing and geometrical structures of such sets are of great importance. In this paper, rigid spherical particles distributed in different sizes are randomly packed in confined spaces, using a parallel algorithm. Mersenne Twister algorithm was used to generate pseudorandom numbers for initial coordination of particles. Di...
متن کاملThe Packing Density of Other Layered Permutations
In this paper the packing density of various layered permutations is calculated, thus solving some problems suggested by Albert, Atkinson, Handley, Holton & Stromquist [Electron. J. Combin. 9 (2002), #R5]. Specifically, the density is found for layered permutations of type [m1, . . . ,mr] when log(r +1) ≤ min{mi}. It is also shown how to derive good estimates for the packing density of permutat...
متن کاملPacking sets of patterns
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this question has been tangentially considered previously, this is the first systematic study of it. We find the packing density for various special sets of permut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 9 شماره
صفحات -
تاریخ انتشار 2002